An Assertion-Guided Derivation of a Circle Drawing Algorithm
نویسنده
چکیده
A raster-based algorithm for drawing circles is derived by using the so-called assertion-guided approach to program construction. The initially derived form is slightly different from published ones. It can, however, be transformed into the secondorder midpoint circle-drawing algorithm. Because of the rigour of the approach, the correctness of the derived algorithm is assured. The approach also naturally brings boundary issues to the fore that might not otherwise be obvious and that appear to have been overlooked in published circle-drawing algorithms. 1 Assertion-guided program
منابع مشابه
Phenomenology of Body and Place Drawing on Merleau-Ponty Case Study: One Hundred Years of Solitude by Gabriel Garcia Marquez
Merleau-Ponty, the prominent phenomenologist of the 20th century has noted the phenomenology of perception. He argued that perception is a corporal (physical) phenomenon. In other words, it is the body which percieves not the mind. The preset study is an attempt based on Merleau-Ponty’s understanding of perception and corporeal sensibility to highlight the importance of human situatedness expre...
متن کاملAn Investigation on the Effects of Optimum Forming Parameters in Hydromechanical Deep Drawing Process Using the Genetic Algorithm
The present research work is concerned with the effects of optimum process variables in elevated temperature hydro-mechanical deep drawing of 5052 aluminum alloy. Punch-workpiece and die-workpiece friction coefficients together with the initial gap between the blank holder and matrix were considered as the process variables which, in optimization terminology, are called design parameters. Since...
متن کاملDrawing the double circle on a grid of minimum size
In 1926, Jarńık introduced the problem of drawing a convex ngon with vertices having integer coordinates. He constructed such a drawing in the grid [1, c · n] for some constant c > 0, and showed that this grid size is optimal up to a constant factor. We consider the analogous problem for drawing the double circle, and prove that it can be done within the same grid size. Moreover, we give an O(n...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملA new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem
Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Alg...
متن کامل